Linear - Time Heuristics for Minimum
نویسندگان
چکیده
We consider the problem of partitioning rectilinear polygons into rectangles, using segments of minimum total length. This problem is NP-hard for polygons with holes. Even for hole-free polygons no known algorithm can nd an optimal partitioning in less than O(n 4) time. We present the rst linear-time algorithm for computing rectangula-tions of hole-free polygons, within a constant factor of the optimum. We achieve this result by deriving a linear-time algorithm for producing rectangulations of histograms of length less than 2.42 times the optimum , and then solving the problem of producing a proper partition into histograms.
منابع مشابه
A bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics
This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...
متن کاملTOWER CRANES AND SUPPLY POINTS LOCATING PROBLEM USING CBO, ECBO, AND VPS
Tower cranes are major and expensive equipment that are extensively used at building construction projects and harbors for lifting heavy objects to demand points. The tower crane locating problem to position a tower crane and supply points in a building construction site for supplying all requests in minimum time, has been raised from more than twenty years ago. This problem has already been so...
متن کاملOn a linear program for minimum-weight triangulation
Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomialtime heuristics that, for many instances, can find the exact MWT. Linear programs (LPs) for MWT are well-studied, but previously no connection was known between any LP and any approximation algorithm or heuristic for MWT. Here we show the first su...
متن کاملComputing Minimum-Link Separating Polygons in Practice∗
We tackle the problem of separating two given sets of polygons by a polygon with minimum number of segments. As the complexity in our specific setting is unknown, we propose heuristics that are simple enough to be implemented in practice. A key ingredient is a new practical linear-time algorithm for minimum-link paths in simple polygons. Experiments in a challenging realistic setting show excel...
متن کاملOptimal design of cross docking supply chain networks with time-varying uncertain demands
This paper proposes an integrated network design model for a post-distribution cross-docking strategy, comprising multi product production facilities with shared production resources, capacitated cross docks with setup cost and customer zones with time windows constraints. The model is dynamic in terms of time-varying uncertain demands, whereas uncertainty is expressed with scenario approach an...
متن کامل